to “ Incentive compatible allocation and exchange of discrete resources

نویسندگان

  • Marek Pycia
  • M. Utku Ünver
چکیده

The lemmas in Appendix C.2 show how requirements R1–R6 are driven by group strategy-proofness and Pareto efficiency. The following examples further illustrate the role of the consistency requirements R4–R6. Requirement R4 is needed to ensure the individual strategy-proofness of the TC mechanisms. This requirement is also needed to ensure the individual strategyproofness of the TTC mechanisms, and it is embedded in Pápai’s (2000) inheritance-tree construction.49

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incentive compatible allocation and exchange of discrete resources

Allocation and exchange of many discrete resources – such as kidneys or school seats – is conducted via direct mechanisms without monetary transfers. A primary concern in designing such mechanisms is the coordinated strategic behavior of market participants and its impact on resulting allocations. To assess the impact of this implementation constraint, we construct the full class of group domin...

متن کامل

Enhancing the Efficiency of and Equity in Transplant Organ Allocation via Incentivized Exchange∗

Within the last decade kidney exchange has become a mainstream paradigm to increase the number of kidney transplants. However, compatible pairs do not participate, and the full benefit from exchange can be realized only if they do. In this paper, we propose a new incentive scheme that relies on incentivizing participation of compatible pairs in exchange via insurance for the patient for a futur...

متن کامل

Non-Optimal Mechanism Design

The optimal allocation of resources in complex environments—like allocation of dynamic wireless spectrum, cloud computing services, and Internet advertising—is computationally challenging even given the true preferences of the participants. In the theory and practice of optimization in complex environments, a wide variety of special and general purpose algorithms have been developed; these algo...

متن کامل

Combinatorial Double Auction-based Scheme for Resource Allocation in Grids

Offering Grid services in an open market determines an optimization case for finding the best suitable resource allocation for a given number of requests and existing resources. Thus, appropriate resource allocation schemes, supporting accounting, are required in addition to a pricing scheme, which supports financial fairness criteria. The newly developed Resource Allocation Model Developed for...

متن کامل

Incentive-Compatible Approximation Mechanism for Auction-Based VM Provisioning in Clouds

Cloud providers face a high number of decision problems when offering Infrastructure as a service to their customers. One of the biggest decision problems is how to provision and allocate resources such that maximizing their profit and the resources are utilized efficiently. Cloud providers provision their resources either statically or dynamically, and then allocate them in the form of virtual...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017